Inferring a level-1 phylogenetic network from a dense set of rooted triplets
نویسندگان
چکیده
منابع مشابه
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets
We consider the following problem: Given a setT of rooted triplets with leaf set L, determine whether there exists a phylogenetic network consistent with T, and if so, construct one. We show that if no restrictions are placed on the hybrid nodes in the solution, the problem is trivially solved in polynomial time by a simple sorting network-based construction. For the more interesting (and biolo...
متن کاملInferring phylogenetic relationships avoiding forbidden rooted triplets
To construct a phylogenetic tree or phylogenetic network for describing the evolutionary history of a set of species is a well-studied problem in computational biology. One previously proposed method to infer a phylogenetic tree/network for a large set of species is by merging a collection of known smaller phylogenetic trees on overlapping sets of species so that no (or as little as possible) b...
متن کاملTripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets
The problem of constructing an optimal rooted phylogenetic network from an arbitrary set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet, which tries to construct a rooted phylogenetic network with the minimum number of reticulation nodes from an arbitrary set of rooted triplets. Despite of current methods that work for dense set of roote...
متن کاملConstructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time
For a given set L of species and a set T of triplets on L, we want to construct a phylogenetic network which is consistent with T , i.e which represents all triplets of T . The level of a network is defined as the maximum number of hybrid vertices in its biconnected components. When T is dense, there exist polynomial time algorithms to construct level-0, 1, 2 networks [1, 10, 11, 17]. For highe...
متن کاملConstructing Rooted Phylogenetic Networks from Triplets based on Height Function
The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is NP-hard. In this paper, we present a novel method called NCH, which tries to construct a rooted phylogenetic network with the minimum numberof reticulation nodes from an arbitrary set of rooted triplets based on the concept of the height function of a tree and a network. We report the pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.06.022